On the Construction of m-Sequences via Primitive Polynomials with a Fast Identification Method
نویسنده
چکیده
The paper provides an in-depth tutorial of mathematical construction of maximal length sequences (m-sequences) via primitive polynomials and how to map the same when implemented in shift registers. It is equally important to check whether a polynomial is primitive or not so as to get proper m-sequences. A fast method to identify primitive polynomials over binary fields is proposed where the complexity is considerably less in comparison with the standard procedures for the same purpose. Keywords—Finite field, irreducible polynomial, primitive polynomial, maximal length sequence, additive shift register, multiplicative shift register.
منابع مشابه
Construction of solitary solution and compacton-like solution by the variational iteration method using He's polynomials
Variational Iteration method using He's polynomials can be used to construct solitary solution and compacton-like solution for nonlinear dispersive equatioons. The chosen initial solution can be determined in compacton-like form or in solitary form with some compacton-like or solitary forms with some unknown parameters, which can be determined in the solution procedure. The compacton-like solu...
متن کاملThe Numerical Solution of Some Optimal Control Systems with Constant and Pantograph Delays via Bernstein Polynomials
In this paper, we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays. Constant or pantograph delays may appear in state-control or both. We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then, these are utilized to reduce the solution of optimal control with constant...
متن کاملComparative study on solving fractional differential equations via shifted Jacobi collocation method
In this paper, operational matrices of Riemann-Liouville fractional integration and Caputo fractional differentiation for shifted Jacobi polynomials are considered. Using the given initial conditions, we transform the fractional differential equation (FDE) into a modified fractional differential equation with zero initial conditions. Next, all the existing functions in modified differential equ...
متن کاملA Fast Localization and Feature Extraction Method Based on Wavelet Transform in Iris Recognition
With an increasing emphasis on security, automated personal identification based on biometrics has been receiving extensive attention. Iris recognition, as an emerging biometric recognition approach, is becoming a very active topic in both research and practical applications. In general, a typical iris recognition system includes iris imaging, iris liveness detection, and recognition. This rese...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کامل